Cache-aware static scheduling for hard real-time multicore systems based on communication affinities

The growing need for continuous processing capabilities has led to the development of multicore systems with a complex cache hierarchy. Such multicore systems are generally designed for improving the performance in average case, while hard real-time systems must consider worst-case scenarios. An open challenge is therefore to efficiently schedule hard real-time tasks on a multicore architecture. In this work, we propose a mathematical formulation for computing a static scheduling that minimize L1 data cache misses between hard real-time tasks on a multicore architecture using communication affinities

Learning to Reconstruct Texture-less Deformable Surfaces from a Single View

Recent years have seen the development of mature solutions for reconstructing deformable surfaces from a single image, provided that they are relatively well-textured. By contrast, recovering the 3D shape of texture-less surfaces remains an open problem, and essentially relates to Shape-from-Shading. In this paper, we introduce a data-driven approach to this problem. We introduce a general framework that can predict diverse 3D representations, such as meshes, normals, and depth maps. Our experiments show that meshes are ill-suited to handle texture-less 3D reconstruction in our context. Furthermore, we demonstrate that our approach generalizes well to unseen objects, and that it yields higher-quality reconstructions than a state-of-the-art SfS technique, particularly in terms of normal estimates. Our reconstructions accurately model the fine details of the surfaces, such as the creases of a T-Shirt worn by a person.Comment: Accepted to 3DV 201

The Thermodynamic Limit of Quantum Coulomb Systems: A New Approach

We present two recent works on the thermodynamic limit of quantum Coulomb systems, in which we provided a general method allowing to show the existence of the limit for many different models.Comment: Talk given by M.L. at QMath10, 10th Quantum Mathematics International Conference, Moeciu (Romania) in September 200

Formal Executable Models for Automatic Detection of Timing Anomalies

A timing anomaly is a counterintuitive timing behavior in the sense that a local fast execution slows down an overall global execution. The presence of such behaviors is inconvenient for the WCET analysis which requires, via abstractions, a certain monotony property to compute safe bounds. In this paper we explore how to systematically execute a previously proposed formal definition of timing anomalies. We ground our work on formal designs of architecture models upon which we employ guided model checking techniques. Our goal is towards the automatic detection of timing anomalies in given computer architecture designs

Monographing "Sacred Laws"

Along with new interest in the subject of Greek “sacred laws”, a series of monographic studies of inscriptions included in this category have recently been published. After Lupu’s addition to the three corpora of Sokolowski, Alexander Herda reedited the decree of the Molpoi from Miletus with a lengthy commentary, which was reviewed in this periodical. That is an unusually complex and detailed text, and the works under review also treat inscriptions of a similar character. While giving a gener..

Adapting to a changing highschool population

This paper reports the recent changes in the EE Bachelor program at the University of Twente. Recent generations of freshman students exhibited a lack in mathematics skills and the ability to grasp the physics behind the equations. By starting of the curriculum with a new course “Introduction to electronics and electrical engineering (IEEE)�? we have managed to solve the issue of lacking entry levels while simultaneously eliminating the unmotivated or under skilled students in a very early stage in their studies

Differences in triage and medical confidentiality between prisons of Belgium and the Netherlands

Objectives: The aim of this study is to describe the opinions of prison doctors, and to compare the primary health care in prisons between Belgium and the Netherlands. Methods: Structured interviews, audio-recorded and transcribed verbatim, were conducted with prison doctors in Dutch-speaking prisons in Flanders/Belgium and in the Netherlands. Two investigators analysed the content of the interviews and discussed each individual interview. Results: In total 37 interviews were conducted in 28 prisons (14 in each country). In Belgium, 14 of 17 prison doctors, compared to 1 of 12 in the Netherlands, experienced higher time pressure during their consultations in prison, compared to their private medical work (P < 0.001). In the Netherlands, compared to Belgium, there is more access to psychiatric support (14/14 vs 11/22, P = 0.002), psychological care (13/13 vs 7/22, P < 0.001), and interpreter facilities (15/22 vs 0/14, P < 0.001). Prison doctors in both countries agree that the possibility for a strictly personal encounter with the patient - without the presence of other medical staff - can be very useful (21/22 in Belgium vs 15/15 in the Netherlands). In Belgium, individual consultations with the detainee are not possible. Conclusions: Compared to the situation in the Netherlands, the medical work of prison doctors in Belgium is characterized by time pressure and lack of psychiatric and psychological support. The absence of interpreter facilities in Belgium handicaps the quality of the primary health care in prisons. In addition, the lack of private encounters with a doctor in Belgian prisons violates the patient rights of the detainee

Performance Evaluation of JXTA Communication layers

The main goal of Project JXTA is to provide a peer-to-peer application framework based on a standard set of generic peer-to-peer protocols, independent of any particular platform or language. In spite of its recent popularity, the performance characteristics of the communication layers of JXTA are not well understood, though there is a general sentiment of inadequate performance. This paper examines the performance of the three JXTA communication layers: the JXTA sockets, JXTA pipe service and JXTA endpoint service. Round-trip time benchmarks are performed to evaluate the bandwidth and latency of each of the communication layers over both a Fast-Ethernet and a Myrinet network using the Java implementation of the JXTA protocols. The results show that, although the JXTA communications exhibit high latency, the Java binding of JXTA is able to reach the throughput of Java sockets. Very interesting results were obtained for benchmarks performed on high-performance Myrinet networks, where two out of the three JXTA communication layers were still able to achieve throughputs in excess of 1 Gb/s